Forward Pruning and Other Heuristic Search Techniques in Tsume Go

نویسنده

  • Thomas Wolf
چکیده

GoTools is the name of a computer program to analyse life & death ghts in the game of go. First, a motivation for programing go is given. General aspects of the heuristic search performed in GoTools are discussed. The absolute strength and the eeect of forward tree pruning are tested in a competition between GoTools and dan level human players. It is found that with a speed up of a factor of 30 the program still nds for 70% of the problems of a test set the correct rst move. A suggestion is made to compare intelligence between contestants (in solving fully enclosed life/death problems) by comparing their relative increase in the time to solve problems with the increase of the diiculty of the problems. The rules of go are explained in the shortest possible form in the appendix.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Learning a Go Heuristic with TILDE

In Go, an important factor that hinders search is the large branching factor, even in local problems. Human players are strong at recognizing frequently occurring shapes and vital points. This allows them to select the most promising moves and to prune the search tree. In this paper we argue that many of these shapes can be represented as relational concepts. We present an application of the re...

متن کامل

Search versus Knowledge for Solving Life and Death Problems in Go

In games research, Go is considered the classical board game that is most resistant to current AI techniques. Large-scale knowledge engineering has been considered indispensable for building state of the art programs, even for subproblems such as Life and Death, or tsume-Go. This paper describes the technologies behind TSUMEGO EXPLORER, a high-performance tsume-Go search engine for enclosed pro...

متن کامل

The PN*-search algorithm: Application to tsume-shogi

This paper proposes a new search algorithm, denoted PN∗, for AND/OR tree search. The algorithm is based on proof-number (PN) search, a best-first search algorithm, proposed by Allis et al. [Artificial Intelligence 66 (1) (1994) 91–124], and on Korf’s RBFS algorithm [Artificial Intelligence 62 (1) (1993) 41–78]. PN∗ combines several existing ideas. It transforms a best-first PN-search algorithm ...

متن کامل

Selective Depth-First Search Methods

In this paper we take a general look at forward pruning in tree search. By identifying what we think are desirable characteristics of pruning heuristics, and what attributes are important for them to consider, we hope to understand better the shortcomings of existing techniques, and to provide some additional insight into how they can be improved. We view this work as a first step towards the g...

متن کامل

Online generation and use of macro-actions in forward-chaining planning

This thesis presents a technique for online learning and management of macroactions in forward chaining planning. Macro-actions are learnt on plateaux, areas of the search landscape where the heuristic cannot offer good search guidance, and are reused when future plateaux are encountered. Libraries of macro-actions are generated, storing macro-actions for use on future problems. Several strateg...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Inf. Sci.

دوره 122  شماره 

صفحات  -

تاریخ انتشار 2000